Scheduling Arrivals to Queues: A Single-Server Model with No-Shows

نویسندگان

  • Refael Hassin
  • Sharon Mendel
چکیده

Q systems with scheduled arrivals, i.e., appointment systems, are typical for frontal service systems, e.g., health clinics. An aspect of customer behavior that influences the overall efficiency of such systems is the phenomenon of no-shows. The consequences of no-shows cannot be underestimated; e.g., British surveys reveal that in the United Kingdom alone more than 12 million general practitioner (GP) appointments are missed every year, costing the British health service an estimated £250 million annually. In this study we answer the following key questions: How should the schedule be computed when there are no-shows? Is it sufficiently accurate to use a schedule designed for the same expected number of customers without no-shows? How important is it to invest in efforts that reduce no-shows—i.e., given that we apply a schedule that takes no-shows into consideration, is the existence of no-shows still costly to the server and customers?

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of unreliable bulk queue with statedependent arrivals

In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...

متن کامل

Stochastic Scheduling ofParallel

We consider the problem of allocating a single server to a system of queues with Poisson arrivals. Each queue represents a class of jobs and possesses a holding cost rate, general service distribution, and a setup cost. The objective is to minimize the expected cost due to the waiting of jobs and the switching of the server. A setup cost is required to eeect an instantaneous switch from one que...

متن کامل

Optimal Stochastic Scheduling of Forest Networks with Switching Penalties 1

We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch setup delays which are incurred at each instant the server processes a job in a queue diierent than the previous one. We use re...

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

Stochastic scheduling of parallel queues with set-up costs

We consider the problem of allocating a single server to a system of queues with Poisson arrivals. Each queue represents a class of jobs and possesses a holding cost rate, general service distribution, and a set-up cost. The objective is to minimize the expected cost due to the waiting of jobs and the switching of the server. A set-up cost is required to effect an instantaneous switch from one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Management Science

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2008